Supersolvable LL-lattices of binary trees
نویسندگان
چکیده
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
منابع مشابه
A Generalization of Semimodular Supersolvable Lattices
Stanley [18] introduced the notion of a supersolvable lattice, L, in part to combinatorially explain the factorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular latt...
متن کاملA broad class of shellable lattices
We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples of (co)modernistic lattices. We show comodernism for two main families of lattices that were not previously known to be shellable: the order congruence latt...
متن کاملHow is a chordal graph like a supersolvable binary matroid?
Let G be a finite simple graph. From the pioneering work of R. P. Stanley it is known that the cycle matroid of G is supersolvable if and only if G is chordal. The chordal binary matroids are not in general supersolvable. Nevertheless we prove that every supersolvable binary matroid determines canonically a chordal graph.
متن کاملBinary Supersolvable Matroids and Modular Constructions
Let Jt be the class of binary matroids without a Fano plane as a submatroid. We show that every supersolvable matroid in JÍ is graphic, corresponding to a chordal graph. Then we characterize the case that the modular join of two matroids is supersolvable. This is used to study modular flats and modular joins of binary supersolvable matroids. We decompose supersolvable matroids in JH as modular ...
متن کاملA Convex-Ear Decomposition for Rank-Selected Subposets of Supersolvable Lattices
Let L be a supersolvable lattice with nonzero Möbius function. We show that the order complex of any rank-selected subposet of L admits a convex-ear decomposition. This proves many new inequalities for the h-vectors of such complexes, and shows that their g-vectors are M-
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 296 شماره
صفحات -
تاریخ انتشار 2005